Average Repair Read Cost of Linear Repairable Code Ensembles

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal binary linear locally repairable codes with disjoint repair groups

In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However, most known constructions are over large fields with sizes close to the code length, which lead to the systems computationally expensive. Due to this, binary...

متن کامل

Approximate Linear Programming for Average Cost MDPs

We consider the linear programming approach to approximate dynamic programming with an average cost objective and a finite state space. Using a Lagrangian form of the LP, the average cost error is shown to be a multiple of the best fit differential cost error. This result is analogous to previous error bounds for a discounted cost objective. Second, bounds are derived for average cost error and...

متن کامل

Locally Repairable Regenerating Code Constructions

In this work, we give locally repairable regenerating code (LRRC) [1]–[4] constructions that can protect the file size promised by the graph analysis of the modified family helper selection (MFHS) scheme [1] at the minimum-bandwidthregenerating (MBR) point. I. RANDOM LINEAR CODE CONSTRUCTION FOR A CLASS OF (n, k, d, r) PARAMETERS In this section, we prove the existence and construction of linea...

متن کامل

Average Bit Erasure Probability of Regular LDPC Code Ensembles under MAP Decoding over BEC

The average bit erasure probability of a binary linear code ensemble under maximum a-posteriori probability (MAP) decoding over binary erasure channel (BEC) can be calculated with the average support weight distribution of the ensemble via the EXIT function and the shortened information function. In this paper, we formulate the relationship between the average bit erasure probability under MAP ...

متن کامل

Punctured Turbo Code Ensembles

We analyze the asymptotic performance of punctured turbo codes. The analysis is based on the union bound on the word error probability of maximum likelihood decoding for a punctured turbo code ensembles averaged over all possible puncturing patterns and interleavers. By using special probabilistic puncturing, we prove that, for a given mother turbo code ensemble [C] with a finite noise threshol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Korea Information and Communications Society

سال: 2014

ISSN: 1226-4717

DOI: 10.7840/kics.2014.39b.11.723